A Hybrid Genetic Algorithm for the Fixed Channel Assignment Problem
نویسندگان
چکیده
This paper describes a hybrid genetic algorithm for solving instances of the Fixed Channel Assignment Problem (FCAP), a problem that is frequently encountered by designers of mobile telecommunication networks. The hybrid GA manipulates solutions which model networks directly, allowing it to provide realistic assignments for highly constrained problems. Unfortunately, such solutions can be very expensive to evaluate. Algorithms such as simulated annealing often speed up the evaluation process by using delta evaluation. Whilst such an approach is not normally adopted by genetic algorithms, this paper demonstrates that delta evaluation can be incorporated into a GA, to deliver dramatic speed increases. We have found that delta evaluation can improve the speed of our GA by a factor of 90. This improved performance allows the GA to produce good results for large and complicated networks in a reasonable amount of time. The results obtained by the GA are compared to previous GA algorithms proposed for the FCAP and to a highly tuned simulated annealing algorithm.
منابع مشابه
An Efficient Hybrid Genetic Algorithm for a Fixed Channel Assignment Problem with Limited Bandwidth
We need an efficient channel assignment algorithm for increasing channel re-usability, reducing call-blocking rate and reducing interference in any cellular systems with limited bandwidth and a large number of subscribers. We propose an efficient hybrid genetic algorithm for a fixed channel assignment problem with limited bandwidth constraint. The proposed GA finds a good sequence of codes for ...
متن کاملLocomotive assignment problem with train precedence using genetic algorithm
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملA genetic algorithm for a bi-objective mathematical model for dynamic virtual cell formation problem
Nowadays, with the increasing pressure of the competitive business environment and demand for diverse products, manufacturers are force to seek for solutions that reduce production costs and rise product quality. Cellular manufacturing system (CMS), as a means to this end, has been a point of attraction to both researchers and practitioners. Limitations of cell formation problem (CFP), as one o...
متن کاملPower Control and Scheduling For Low SNR Region in the Uplink of Two Cell Networks
In this paper we investigate the sub-channel assignment and power control to maximize the total sum rate in the uplink of two-cell network. It is assumed that there are some sub-channels in each cell which should be allocated among some users. Also, each user is subjected to a power constraint. The underlying problem is a non-convex mixed integer non-linear optimization problem which does not h...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کامل